#include <bits/stdc++.h>
using namespace std;

#ifndef ONLINE_JUDGE
    #include <bits/debug.h>
#endif

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T> using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += (int)(c))
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i <= (int)(b); i -= (int)(c))
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x) & (-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()

void solve() {
    int n;
    cin >> n;
    V<int> p(n);
    int tot = 0;
    FOR(i, 1, n - 1) cin >> p[i];

    V<int> w(n + 1, 0);
    int a = 0;
    w[1] = 1;
    FOR(i, 1, n - 1) {
        a += p[i];
        if (a < 0) {
            w[1] = max(w[1], -a + 1);
        } else {
            w[1] = min(w[1], n - a);
        }
    }

    FOR(i, 1, n - 1) {
        tot += p[i];
        w[i + 1] = w[1] + tot;
    }

    set<int> s;

    FOR(i, 1, n) {
        s.insert(w[i]);
    }

    FOR(i, 1, n) {
        if (!s.count(i)) {
            cout << -1 << endl;
            RE;
        }
    }
    FOR(i, 1, n) cout << w[i] << " \n"[i == n];
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    while (Task--) {
        solve();
    }

    return 0;
}
